Building Inverted Indexes Using Balanced Trees Over DHT Systems
نویسندگان
چکیده
Objects containing the document locations for popular keywords are sufficiently large to create storage hotspots at some hosts. Since each object is assigned to a single key, DHT key based load balancing techniques are incapable of splitting the object through several hosts. Furthermore, caching techniques only reduce network load for query operations and not handling network load during insert operations.
منابع مشابه
Using Distributed Balanced Trees Over DHTs for Building Large-scale Indexes
DHT systems are structured overlay networks capable of using P2P resources as a scalable storage platform for very large data applications. However, their efficiency expects a level of uniformity in the association of data to index keys that is often not present in inverted indexes. Index data tends to follow non-uniform distributions, often power law distributions, creating intense local stora...
متن کاملTaming Hot-Spots in DHT Inverted Indexes
DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency expects a level of uniformity in the association of data to index keys that is often not present in inverted indexes. Index data tends to follow nonuniform distributions, often power law distributions, creating intense local storag...
متن کاملA Tabu-Based Cache to Improve Range Queries on Prefix Trees
Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peerto-Peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building dis...
متن کاملFlexible Sharing in Dht-based P2p Networks Using Metadata of Resource
DHT-based P2P systems have the ability to map a resource’s identifier to its location, so a resource can be located by the unique identifier of the resource. In such systems users must know the identifier of a resource exactly to find the resource. However, a resource can not be described accurately and integrally only by an identifier for the variety and complexity of resources, and needs mult...
متن کاملProof: A Novel DHT-Based Peer-to-Peer Search Engine
In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current stateof-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005